Proof - Checking a Data Link
نویسندگان
چکیده
A data link protocol developed and used by Philips Electronics is modeled and veriied using I/O automata theory. Correctness is computer-checked with the Coq proof development system. AMS Subject Classiication (1991): 03B15 Mathematical logic and foundations]: Higher-order logic and type theory; 03B35 Mathematical logic and foundations]: Mechanization of proofs and logical operations; 68Q22 Computer science]: Parallel and distributed algorithms; 68Q60 Computer science]: Speciication and veriication of programs. and related systems, mechanical theorem proving.
منابع مشابه
Proof-Checking a Data Link Protocol
A data link protocol developed and used by Philips Elec tronics is modeled and veri ed using I O automata theory Correctness is computer checked with the Coq proof development system
متن کاملg Different Formal i sms for Hardware Verification
Model Checking as the predominant technique for automatically verifying circuits suffers from the well-known state explosion problem. This hinders the verification of circuits which contain non-trivial data paths. Recently, it has been shown that for those circuits it may be useful to separate the control and data part prior to verification. This paper is also based on this idea and presents an...
متن کاملAn Approach to Link HOL and MDG for Hardware Veri cation
In order to overcome the limitations of automated tools and the cumbersome proof process of interactive theorem proving, we adopt an hybrid approach for formal hardware veri cation by linking HOL and MDG. This approach uses the strengths of theorem proving (HOL) with its powerful mathematical tools such as induction and abstraction, and the advantages of automated tools (MDG) which support equi...
متن کاملProof Checking Technology for Satisfiability Modulo Theories
A common proof format for solvers for Satisfiability Modulo Theories (SMT) is proposed, based on the Edinburgh Logical Framework (LF). Two problems arise: checking very large proofs, and keeping proofs compact in the presence of complex side conditions on rules. Incremental checking combines parsing and proof checking in a single step, to avoid building in-memory representations of proof subter...
متن کاملFormal Specification and Analysis of Zeroconf Using Uppaal?
We report on a case study in which the model checker Uppaal is used to formally model parts of Zeroconf, a protocol for dynamic configuration of IPv4 link-local addresses that has been defined in RFC 3927 of the IETF. Our goal has been to construct a model that (a) is easy to understand by engineers, (b) comes as close as possible to the informal text (for each transition in the model there sho...
متن کامل